Cycles and paths in edge-colored graphs with given degrees
نویسندگان
چکیده
Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are inverstigated. In particular, we prove that an edgecolored multigraph of order n on at least three colors and with minimum colored degree greater than or equal to d 2 e has properly edge-colored cycles of all possible lengths, including hamiltonian cycles. Longest properly edge-colored paths and hamiltonian paths between given vertices are considered as well.
منابع مشابه
Maximum colored trees in edge-colored graphs
Abstract We consider maximum properly edge-colored trees in edge-colored graphs Gc. We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree rooted at r, such that all root-to-leaf paths are properly colored. We consider these problems from graphtheoretic as well as algorithmic viewpoints. We prove their optimization versions to be NP-hard in general...
متن کاملPartitioning 2-edge-colored graphs by monochromatic paths and cycles
We present results on partitioning the vertices of 2-edge-colored graphs into monochromatic paths and cycles. We prove asymptotically the two-color case of a conjecture of Sárközy: the vertex set of every 2-edge-colored graph can be partitioned into at most 2α(G) monochromatic cycles, where α(G) denotes the independence number of G. Another direction, emerged recently from a conjecture of Schel...
متن کاملPartitioning edge-2-colored graphs by monochromatic paths and cycles
We present results on partitioning the vertices of 2-edge-colored graphs into monochromatic paths and cycles. We prove asymptotically the two-color case of a conjecture of Sárközy: the vertex set of every 2-edge-colored graph can be partitioned into at most 2α(G) monochromatic cycles, where α(G) denotes the independence number of G. Another direction, emerged recently from a conjecture of Schel...
متن کاملOn paths, trails and closed trails in edge-colored graphs
In this paper we deal from an algorithmic perspective with different questions regarding properly edge-colored (or PEC) paths, trails and closed trails. Given a c-edge-colored graph G, we show how to polynomially determine, if any, a PEC closed trail subgraph whose number of visits at each vertex is specified before hand. As a consequence, we solve a number of interesting related problems. For ...
متن کاملThe Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs
We introduce a number of problems regarding edge-color modifications in edge-colored graphs and digraphs. Consider a property π, a c-edge-colored graph G not satisfying π, and an edge-recoloring cost matrix R = [rij ]c×c where rij ≥ 0 denotes the cost of changing color i of edge e to color j. Basically, in this kind of problem the idea is to change the colors of one or more edges of G in order ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 64 شماره
صفحات -
تاریخ انتشار 2010